Enumerative combinatorics

Results: 139



#Item
71General Mathematics Vol. 20, No[removed]), 122–134  A note on multi Poly-Euler numbers and Bernoulli p olynomials 1 Hassan Jolany, Mohsen Aliabadi, Roberto B. Corcino, and M.R.Darafsheh

General Mathematics Vol. 20, No[removed]), 122–134 A note on multi Poly-Euler numbers and Bernoulli p olynomials 1 Hassan Jolany, Mohsen Aliabadi, Roberto B. Corcino, and M.R.Darafsheh

Add to Reading List

Source URL: depmath.ulbsibiu.ro

Language: English - Date: 2014-01-24 13:25:35
72PROBLEM OF THE WEEK Solution of Problem No. 2 (Spring 2014 Series) Problem: It is known that, for any positive integer m, X

PROBLEM OF THE WEEK Solution of Problem No. 2 (Spring 2014 Series) Problem: It is known that, for any positive integer m, X

Add to Reading List

Source URL: www.math.purdue.edu

Language: English - Date: 2014-02-11 13:26:55
73Ekhad and the Master Shalosh B. Ekhad is known to be Doron Zeilberger’s beloved computer companion. Perusing Lewis Carroll’s poem “The Walrus and the Carpenter”

Ekhad and the Master Shalosh B. Ekhad is known to be Doron Zeilberger’s beloved computer companion. Perusing Lewis Carroll’s poem “The Walrus and the Carpenter”

Add to Reading List

Source URL: www.math.rutgers.edu

Language: English - Date: 2010-06-07 13:34:19
741 DeBruijn Counting for Visualization Algorithms David C. Banks? Florida State University and Paul Stockmeyer?? College of William and Mary No Institute Given Abstract. We describe how to determine the number of cases th

1 DeBruijn Counting for Visualization Algorithms David C. Banks? Florida State University and Paul Stockmeyer?? College of William and Mary No Institute Given Abstract. We describe how to determine the number of cases th

Add to Reading List

Source URL: lmi.bwh.harvard.edu

Language: English - Date: 2006-04-24 15:09:07
75FACE-TO-FACE  Face to Face This section features conversations with personalities related to science, highlighting the factors and circumstances that guided them in making the career choice to be a scientist.

FACE-TO-FACE Face to Face This section features conversations with personalities related to science, highlighting the factors and circumstances that guided them in making the career choice to be a scientist.

Add to Reading List

Source URL: www.maths.qmul.ac.uk

Language: English - Date: 2013-09-18 10:29:41
76Squinting at Power Series M. Douglas McIlroy AT&T Bell Laboratories Murray Hill, New Jersey[removed]ABSTRACT Data streams are an ideal vehicle for handling power series. Stream

Squinting at Power Series M. Douglas McIlroy AT&T Bell Laboratories Murray Hill, New Jersey[removed]ABSTRACT Data streams are an ideal vehicle for handling power series. Stream

Add to Reading List

Source URL: swtch.com

Language: English - Date: 2005-09-27 12:15:39
77Notes on counting Peter J. Cameron School of Mathematical Sciences Queen Mary, University of London Mile End Road London E1 4NS

Notes on counting Peter J. Cameron School of Mathematical Sciences Queen Mary, University of London Mile End Road London E1 4NS

Add to Reading List

Source URL: www.maths.qmul.ac.uk

Language: English - Date: 2003-04-10 07:05:42
78A Note on Modular Partitions and Necklaces N. J. A. Sloane, Rutgers University and The OEIS Foundation Inc. 11 South Adelaide Avenue, Highland Park, NJ 08904, USA. Email: [removed] May 6, 2014

A Note on Modular Partitions and Necklaces N. J. A. Sloane, Rutgers University and The OEIS Foundation Inc. 11 South Adelaide Avenue, Highland Park, NJ 08904, USA. Email: [removed] May 6, 2014

Add to Reading List

Source URL: neilsloane.com

Language: English - Date: 2014-05-06 14:20:00
79The MuPAD-Combinat project  Motivations Building a *-Combinat package?

The MuPAD-Combinat project Motivations Building a *-Combinat package?

Add to Reading List

Source URL: mupad-combinat.sourceforge.net

Language: English - Date: 2006-09-27 06:35:13
80[removed]ON THE ROTATION DISTANCE BETWEEN BINARY TREES PATRICK DEHORNOY Abstract. We develop combinatorial methods for computing the rotation distance between binary trees, i.e., equivalently, the flip distance between t

[removed]ON THE ROTATION DISTANCE BETWEEN BINARY TREES PATRICK DEHORNOY Abstract. We develop combinatorial methods for computing the rotation distance between binary trees, i.e., equivalently, the flip distance between t

Add to Reading List

Source URL: www.math.unicaen.fr

Language: English - Date: 2009-01-16 12:26:25